Dual codes of product semi-linear codes

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

Matrix-Product Complementary dual Codes

Linear complementary dual codes (LCD) are linear codes satisfying C ∩C = {0}. Under suitable conditions, matrix-product codes that are complementary dual codes are characterized. We construct LCD codes using quasi-orthogonal matrices. Some asymptotic results are derived.

On involutions in extremal self-dual codes and the dual distance of semi self-dual codes

A classical result of Conway and Pless is that a natural projection of the xed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual [13]. In this paper we prove that the same holds for involutions under some (quite strong) conditions on the codes. In order to prove it, we introduce a new family of binary codes: the semi self-dual codes. A binary self-orthogo...

On the Grobner Basis of a Family of Quasi-Cyclic LDPC Codes

On {\sigma}-LCD codes

Linear complementary pairs (LCP) of codes play an important role in armoring implementations against side-channel attacks and fault injection attacks. One of the most common ways to construct LCP of codes is to use Euclidean linear complementary dual (LCD) codes. In this paper, we first introduce the concept of linear codes with σ complementary dual (σ-LCD), which includes known Euclidean LCD c...